Subgraph Matching using Compactness Prior for Robust Feature Correspondence - Supplementary Material -
نویسندگان
چکیده
1. Additional Experimental Results In this section, we provide more comparative experimental results.In Section 1.1, the experimental results on the whole object classes in the Willow dataset are given. Some qualitative matching results of the Willow dataset are shown in Section 1.2. 1.1. Willow Object Dataset Under the same experimental settings explained in Section 6.2 of the main paper, we have compared the performance of the proposed method with those of four state-of-the-art graph matching algorithms, namely, FGM [4], RRWM [1], IPFP [2] and SEA [3] on the whole 5 classes of objects in the Willow dataset including face, car, wine bottle, motorbike, and duck. Figure 1 shows the resulting balanced F-score plots according to the the number of outliers. 1.2. Qualitative Results In this section, we provide some examples of matching results for the Willow dataset in Section 1.1. The results are shown in Figure 2 to Figure 6, demonstrating superiority of the proposed method over the other existing methods.
منابع مشابه
Subgraph Matching using Compactness Prior for Robust Feature Correspodence
Feature correspondence is widely formulated as a graph matching problem due to its robust performance under challenging conditions. A variety of fast and accurate algorithms have been proposed for graph matching. However, most of them focus on improving the recall of the solution while rarely considering its precision, thus inducing a solution with numerous outliers [1, 7]. To address both prec...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملA Mixture Model for Robust Point Matching under Multi-Layer Motion
This paper proposes an efficient mixture model for establishing robust point correspondences between two sets of points under multi-layer motion. Our algorithm starts by creating a set of putative correspondences which can contain a number of false correspondences, or outliers, in addition to the true correspondences (inliers). Next we solve for correspondence by interpolating a set of spatial ...
متن کاملA Novel Stochastic Attributed Relational Graph Matching Based on Relation Vector Space Analysis
In this paper, we propose a novel stochastic attributed relational graph (SARG) matching algorithm in order to cope with possible distortions due to noise and occlusion. The support flow and the correspondence measure between nodes are defined and estimated by analyzing the distribution of the attribute vectors in the relation vector space. And then the candidate subgraphs are extracted and ord...
متن کاملDescriptor-Free Smooth Feature-Point Matching for Images Separated by Small/Mid Baselines
Most existing feature-point matching algorithms rely on photometric region descriptors to distinct and match feature points in two images. In this paper, we propose an efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images separated by small or mid camera baselines. The proposed algorithm does not rely on photometric descriptors for matching...
متن کامل